NP-Complete Problems in Cellular Automata
نویسنده
چکیده
An example of a cellular automat on (CA) is given in which the following problems are NP -complete: (i) determining if a given subconfigurati cn s can be gener ated af ter [s] t ime steps, (ii) determining if a given eubccnfigurat ion 8 will rec ur afte r lsi t ime steps, (iii) determining if a given te mporal sequence of state s 8 can be generated in lsi time steps. It is also found that the CA constructed bas an NP -hard limit language.
منابع مشابه
A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کاملInversion of 2D Cellular Automata: Some Complexity Results
Durand, B. Inversion of 2D cellular automata: some complexity results, Theoretical Computer Science 134 (1994) 387401. In this paper, we prove the co-NP-completeness of the following decision problem: “Given a twodimensional cellular automaton & (even with Von Neumann neighborhood), is & injective when restricted to finite configurations not greater than its length?” In order to prove this resu...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملConstrained Eden
Let CA be a one-dimensional cellular automaton. A computational complexity problem, the Constrained Eden problem, denoted C-EDEN(CA), is introduced. C-EDEN(CA) is a finitary variant of the Garden of Eden problem. Even for certain elementary cellular automata, C-EDEN(CA) is NP-complete, providing the first examples of NP-complete problems associated with cellular automata over a twoelement alpha...
متن کاملInversion of 2d Cellular Automata: Some Complexity Results Inversion of 2d Cellular Automata: Some Complexity Results
In this paper, we prove the co-NP-completeness of the following decision problem: \given a 2-dimensional cellular automaton A, is A injective when restricted to nite conngurations not greater than its length?" In order to prove this result, we introduce two decision problems concerning respectively Turing Machines and tilings that we prove NP-complete. We then present a transformation of proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 1 شماره
صفحات -
تاریخ انتشار 1987